A GRASP with penalty objective function for the Green Vehicle Routing Problem with Private Capacitated Stations

Due to the recent worries about environment, transportation companies are incentivized use Alternative Fuel Vehicles (AFVs) instead of conventional ones. However, due limited AFV driving range and since Stations (AFSs) usually not widespread on territory, routes AFVs have be properly planned in order prevent them from remaining without sufficient fuel reach depot or closest station. The Green Vehicle Routing Problem (G-VRP) aims at determining routes, each one serving customers within a maximum duration, minimizing total travel distance and, if necessary, including stops AFSs. Contrary G-VRP, G-VRP with Capacitated AFSs (G-VRP-CAFS) more realistically assumes that AFS has number fueling pumps therefore prevents overlapping refueling operations. In this paper, we propose Greedy Randomized Adaptive Search Procedure (GRASP), which uses some theoretical results efficiently solves large-sized instances G-VRP-CAFS. Computational carried out both benchmark show effectiveness efficiency proposed GRASP.